Quantifying chaos: a tale of two maps
نویسنده
چکیده
In many applications, there is a desire to determine if the dynamics of interest are chaotic or not. Since positive Lyapunov exponents are a signature for chaos, they are often used to determine this. Reliable estimates of Lyapunov exponents should demonstrate evidence of convergence; but literature abounds in which this evidence lacks. This paper presents two maps through which it highlights the importance of providing evidence of convergence of Lyapunov exponent estimates. The results suggest cautious conclusions when confronted with real data. Moreover, the maps are interesting in their own right.
منابع مشابه
Two Novel Chaos-Based Algorithms for Image and Video Watermarking
In this paper we introduce two innovative image and video watermarking algorithms. The paper’s main emphasis is on the use of chaotic maps to boost the algorithms’ security and resistance against attacks. By encrypting the watermark information in a one dimensional chaotic map, we make the extraction of watermark for potential attackers very hard. In another approach, we select embedding po...
متن کاملA chaos-based video watermarking algorithm
The intriguing characteristics of chaotic maps have prompted researchers to use these sequences in watermarking systems to good effect. In this paper we aim to use a tent map to encrypt the binary logo to achieve a like-noise signal. This approach makes extraction of the watermark signal by potential attacker very hard. Embedding locations are selected based on certain principles. Experimental ...
متن کاملCHAOS EMBEDDED CHARGED SYSTEM SEARCH FOR PRACTICAL OPTIMIZATION PROBLEMS
Chaos is embedded to the he Charged System Search (CSS) to solve practical optimization problems. To improve the ability of global search, different chaotic maps are introduced and three chaotic-CSS methods are developed. A comparison of these variants and the standard CSS demonstrates the superiority and suitability of the selected variants for practical civil optimization problems.
متن کاملClassifying and quantifying basins of attraction.
A scheme is proposed to classify the basins for attractors of dynamical systems in arbitrary dimensions. There are four basic classes depending on their size and extent, and each class can be further quantified to facilitate comparisons. The calculation uses a Monte Carlo method and is applied to numerous common dissipative chaotic maps and flows in various dimensions.
متن کاملAN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS
The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods...
متن کامل